Roots of quantum computing supremacy: superposition, entanglement, or complementarity?

Abstract The recent claim of Google to have brought forth a breakthrough in quantum computing represents major impetus further analyze the foundations for any claims superiority regarding algorithms. This note attempts present conceptual step this direction. I start with critical analysis what is commonly referred as entanglement and nonlocality whether or not these concepts may be basis superiority. Bell-type experiments are then interpreted statistical tests Bohr’s principle complementarity (PCOM), which is, thus, given foothold within area informatics computation. PCOM implies (by its connection probability) that probabilistic algorithms proceed without knowledge joint probability distributions (jpds). computation jpds exponentially time consuming. Consequently, classical algorithms, involving n random variables, can outperformed by (for large values ). Quantum theory (QPT) modifies formula total (FTP). Inference based on version FTP leads constructive interference increases some events reduces others. physical realization advantage discreteness phenomena (as opposed continuity phenomena).